#include <bits/stdc++.h>
using namespace std;
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
using ll = long long;
ll n;
char s[222];
void dfs(int pos, int sum, int now)
{
    if (pos == n)
    {
        if (sum + now == 0)
        {
            printf("%s\n", s);
        }
        return;
    }
    s[pos * 2 - 1] = ' ';
    if (now > 0)
    {
        dfs(pos + 1, sum, now * 10 + pos + 1);
    }
    else
    {
        dfs(pos + 1, sum, now * 10 - pos - 1);
    }
    s[pos * 2 - 1] = '+';
    dfs(pos + 1, sum + now, pos + 1);
    s[pos * 2 - 1] = '-';
    dfs(pos + 1, sum +now, -(pos + 1));
}
void solve()
{
    cin >> n;
    for (ll i = 0; i < 2 * n; i++)
    {
        s[i * 2] = i + '1';
    }
    dfs(1, 0, 1);
}
int main()
{
    int t = 1;
    //cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}
